Using signature sequences to classify intersection curves of two quadrics
نویسندگان
چکیده
Article history: Received 27 July 2007 Received in revised form 21 July 2008 Accepted 6 August 2008 Available online 10 September 2008
منابع مشابه
Signature Sequence of Intersection Curve of Two Quadrics for Exact Morphological Classification
Computing the intersection curve of two quadric surfaces is an important problem in geometric computation, ranging from shape modeling in computer graphics and CAD/CAM, collision detection in robotics and computational physics, to arrangement computation in computational geometry. We present the solution to the fundamental problem of complete classification of morphologies of the intersection c...
متن کاملComputing quadric surface intersections based on an analysis of plane cubic curves
Computing the intersection curve of two quadrics is a fundamental problem in computer graphics and solid modeling. We present an algebraic method for classifying and parameterizing the intersection curve of two quadric surfaces. The method is based on the observation that the intersection curve of two quadrics is birationally related to a plane cubic curve. In the method this plane cubic curve ...
متن کاملConversion CSG-BRep de scènes définies par des quadriques. (Boundary evaluation of scenes defined by quadrics)
The objective of this thesis is to investigate the problem of boundary evaluation, which transforms the CSG model of a scene to its BRep corresponding model, for scenes defined by quadrics. This algorithm consists of four steps : (i) the parameterization of every intersection curve between quadrics ; (ii) the calculation of the intersection points between such curves and the quadrics ; (iii) th...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Evaluation of different approaches in 3D curved kernel for arrangements of quadrics
Within the context of the ACS project we have investigated two approaches towards the arrangements of quadrics. The first approach, which is presented in ACS-TR-241402-01, computes the adjacency graph of the arrangement and is based on an exact parameterization of the appearing intersection curves. The second approach, which is presented in ACS-TR-241402-02, computes the arrangement on each qua...
متن کاملA Complete, Exact and Efficient Implementation for Computing the Adjacency Graph of an Arrangement of Quadrics
We present a complete, exact and efficient implementation to compute the adjacency graph of an arrangement of quadrics, i.e. surfaces of algebraic degree 2. This is a major step towards the computation of the full 3D arrangement. We enhanced an implementation for an exact parameterization of the intersection curves of two quadrics, such that we can compute the exact parameter value for intersec...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Computer Aided Geometric Design
دوره 26 شماره
صفحات -
تاریخ انتشار 2009